Predicting Model and Algorithm in RNA Folding Structure Including Pseudoknots
نویسندگان
چکیده
منابع مشابه
Predicting RNA Secondary Structures Including Pseudoknots
RNA secondary structures play a vital role in modern genetics and a lot of time and e ort has been put into their study. It is important to be able to predict them with high accuracy, since methods involving manual analysis are expensive, time-consuming and error-prone. Predictions can also be used to guide experiments to reduce time and money requirements. Several algorithms have been develope...
متن کاملNew Heuristic Algorithm of RNA Structure Prediction Including Pseudoknots
Computational models and methods for predicting secondary structure of RNA sequence are in demand. Based on MFE principle and the relative stability of the n-stems in RNA molecules, Minimum Free Energy method is adopted widely to predict RNA secondary structure. An improved heuristic algorithm is presented to predict RNA pseudoknotted structure, and it can compute arbitrary pseudoknots. The alg...
متن کاملA dynamic programming algorithm for RNA structure prediction including pseudoknots.
We describe a dynamic programming algorithm for predicting optimal RNA secondary structure, including pseudoknots. The algorithm has a worst case complexity of O(N6) in time and O(N4) in storage. The description of the algorithm is complex, which led us to adopt a useful graphical representation (Feynman diagrams) borrowed from quantum field theory. We present an implementation of the algorithm...
متن کاملRNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may contain pseudoknots, is computationally intractable when no prior knowledge on the pseudoknot structures the sequence contains is available. In this paper, we consider stable stems in an RNA sequence and provide a new ch...
متن کاملKinefold web server for RNA/DNA folding path and structure prediction including pseudoknots and knots
The Kinefold web server provides a web interface for stochastic folding simulations of nucleic acids on second to minute molecular time scales. Renaturation or co-transcriptional folding paths are simulated at the level of helix formation and dissociation in agreement with the seminal experimental results. Pseudoknots and topologically 'entangled' helices (i.e. knots) are efficiently predicted ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pattern Recognition and Artificial Intelligence
سال: 2018
ISSN: 0218-0014,1793-6381
DOI: 10.1142/s0218001418510059